全文获取类型
收费全文 | 359篇 |
免费 | 12篇 |
出版年
2021年 | 11篇 |
2019年 | 12篇 |
2018年 | 6篇 |
2017年 | 8篇 |
2016年 | 12篇 |
2015年 | 14篇 |
2014年 | 13篇 |
2013年 | 82篇 |
2012年 | 3篇 |
2011年 | 2篇 |
2010年 | 2篇 |
2009年 | 3篇 |
2008年 | 5篇 |
2007年 | 4篇 |
2006年 | 4篇 |
2005年 | 4篇 |
2003年 | 2篇 |
2002年 | 5篇 |
2001年 | 6篇 |
2000年 | 4篇 |
1999年 | 4篇 |
1998年 | 8篇 |
1997年 | 8篇 |
1993年 | 2篇 |
1991年 | 4篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 3篇 |
1986年 | 15篇 |
1985年 | 9篇 |
1984年 | 7篇 |
1983年 | 5篇 |
1982年 | 5篇 |
1981年 | 8篇 |
1980年 | 5篇 |
1979年 | 11篇 |
1978年 | 7篇 |
1977年 | 7篇 |
1976年 | 2篇 |
1975年 | 9篇 |
1974年 | 7篇 |
1973年 | 5篇 |
1972年 | 7篇 |
1971年 | 4篇 |
1970年 | 4篇 |
1969年 | 6篇 |
1968年 | 3篇 |
1967年 | 2篇 |
1966年 | 3篇 |
1948年 | 1篇 |
排序方式: 共有371条查询结果,搜索用时 265 毫秒
21.
About thirty references that feature naval logistics environments are considered. All are unclassified and all appear in the open literature or are available from the Defense Logistics Studies Information Exchange. Three approaches are identified–data analysis, theoretical models, and readiness indexes–and conclusions are presented as to possibilities for answering two questions: (a) Can the unit do the job? (b) How does readiness depend on resources? Four cases are treated in detail to illustrate methodology. 相似文献
22.
This paper reconsiders the classical model for selling an asset in which offers come in daily and a decision must then be made as to whether or not to sell. For each day the item remains unsold a continuation (or maintenance cost) c is incurred. The successive offers are assumed to be independent and identically distributed random variables having an unknown distribution F. The model is considered both in the case where once an offer is rejected it may not be recalled at a later time and in the case where such recall of previous offers is allowed. 相似文献
23.
An explicit steady state solution is determined for the distribution of the number of customers for a queueing system in which Poisson arrivals are bulks of random size. The number of customers per bulk varies randomly between 1 and m, m arbitrary, according to a point multinomial, and customer service is exponential. Queue characteristics are given. 相似文献
24.
S. Christian Albright 《海军后勤学研究》1976,23(1):151-159
This paper deals with the Secretary Problem where n secretaries are interviewed sequentially and the best k must be hired. The values of the secretaries are observed as they are interviewed, but beforehand only the distributions of these values are known. Furthermore, the distributions of two successive secretaries' values are governed by a Markov chain. Optimal hiring policies for finite n and limiting optimal policies as k and n approach infinity are obtained. 相似文献
25.
The ordered matrix flow shop problem with no passing of jobs is considered. In an earlier paper, the authors have considered a special case of the problem and have proposed a simple and efficient algorithm that finds a sequence with minimum makespan for a special problem. This paper considers a more general case. This technique is shown to be considerably more efficient than are existing methods for the conventional flow shop problems. 相似文献
26.
Matthew S. Goldberg 《Defence and Peace Economics》2018,29(1):44-61
AbstractIn Operation Iraqi Freedom, which ended in August 2010, nearly 3500 hostile deaths occurred among US military personnel and 32,000 more were wounded in action (WIA). More than 1800 hostile deaths occurred during Operation Enduring Freedom (in and around Afghanistan) through 2014 and about 20,000 were WIA. A larger proportion of wounded personnel survived in Iraq and Afghanistan than during the Vietnam War, but the increased survival rates were not as high as some studies have asserted. The survival rates were 90.2% in Iraq and 91.6% in Afghanistan, compared with 86.5% in Vietnam. The casualty rates varied between the conflicts in Iraq and Afghanistan and before, during, and after the respective surges. Amputation rates are difficult to measure consistently, but I estimate that 2.6% of all WIA and 9.0% of medically evacuated WIA from the Iraq and Afghanistan theaters combined resulted in the major loss of a limb. Elevated non-hostile death rates (including deaths due to accidents, illnesses, homicides, or suicides) resulted in about 220 more deaths in Iraq and about 200 more deaths in Afghanistan than would have been expected in peacetime among populations of the size deployed to those two conflicts. 相似文献
27.
Christopher G. Pernin Angela O’Mahony Thomas S. Szayna Derek Eaton Katharina Ley Best Elizabeth Bodine-Baron 《Defense & Security Analysis》2017,33(3):209-222
US national security guidance, as well as the US Army’s operational experiences since 2001, emphasizes the importance of working closely with partner countries to achieve US strategic objectives. The US Army has introduced the global landpower network (GLN) concept as a means to integrate, sustain and advance the Army’s considerable ongoing efforts to meet US national security guidance. This study develops the GLN concept further, and addresses three questions. What benefits can the GLN provide the Army? What are the essential components of the GLN? What options exist for implementing the GLN concept? By developing the GLN concept, the Army has the opportunity to transition the GLN from an often ad hoc and reactive set of relationships to one that the Army more self-consciously prioritizes and leverages as a resource to meet US strategic objectives. 相似文献
28.
In this article, we discuss the optimal allocation problem in a multiple stress levels life‐testing experiment when an extreme value regression model is used for statistical analysis. We derive the maximum likelihood estimators, the Fisher information, and the asymptotic variance–covariance matrix of the maximum likelihood estimators. Three optimality criteria are defined and the optimal allocation of units for two‐ and k‐stress level situations are determined. We demonstrate the efficiency of the optimal allocation of units in a multiple stress levels life‐testing experiment by using real experimental situations discussed earlier by McCool and Nelson and Meeker. Monte Carlo simulations are used to show that the optimality results hold for small sample sizes as well. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007 相似文献
29.
…Rapid indigenisation is the cornerstone of our policy of self-reliance India MoD Annual Report 1978–9
相似文献
30.
We consider the problem of scheduling a set of n jobs on a single batch machine, where several jobs can be processed simultaneously. Each job j has a processing time pj and a size sj. All jobs are available for processing at time 0. The batch machine has a capacity D. Several jobs can be batched together and processed simultaneously, provided that the total size of the jobs in the batch does not exceed D. The processing time of a batch is the largest processing time among all jobs in the batch. There is a single vehicle available for delivery of the finished products to the customer, and the vehicle has capacity K. We assume that K = rD, where and r is an integer. The travel time of the vehicle is T; that is, T is the time from the manufacturer to the customer. Our goal is to find a schedule of the jobs and a delivery plan so that the service span is minimized, where the service span is the time that the last job is delivered to the customer. We show that if the jobs have identical sizes, then we can find a schedule and delivery plan in time such that the service span is minimum. If the jobs have identical processing times, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most 11/9 times the optimal service span. When the jobs have arbitrary processing times and arbitrary sizes, then we can find a schedule and delivery plan in time such that the service span is asymptotically at most twice the optimal service span. We also derive upper bounds of the absolute worst‐case ratios in both cases. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 470–482, 2015 相似文献